Autonomous Estimation of High-Dimensional Coulomb Diamonds from Sparse Measurements

نویسندگان

چکیده

Quantum dot arrays possess ground states governed by Coulomb energies, utilized prominently singly occupied quantum dots, each implementing a spin qubit. For such processors, the controlled transitions between are of operational significance, as these allow control information within array qubit initialization and entangling gates. few-dot arrays, traditionally mapped out performing dense raster-scan measurements in control-voltage space. These become impractical for larger due to large number needed sample high-dimensional gate-voltage hypercube comparatively little extracted. We develop hardware-triggered detection method based on reflectometry, acquire directly corresponding states. distributed sparsely voltage space executing line searches proposed learning algorithm. Our autonomous software-hardware algorithm accurately estimates polytope blockade boundaries, experimentally demonstrated 2$\times$2 silicon dots.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Swapping Variables for High-Dimensional Sparse Regression from Correlated Measurements

We consider the high-dimensional sparse linear regression problem of accurately estimating a sparse vector using a small number of linear measurements that are contaminated by noise. It is well known that the standard cadre of computationally tractable sparse regression algorithms—such as the Lasso, Orthogonal Matching Pursuit (OMP), and their extensions—perform poorly when the measurement matr...

متن کامل

Sparse estimation of high-dimensional correlation matrices

Estimating covariations of variables for high dimensional data is important for understanding their relations. Recent years have seen several attempts to estimate covariance matrices with sparsity constraints. A new convex optimization formulation for estimating correlation matrices, which are scale invariant, is proposed as opposed to covariance matrices. The constrained optimization problem i...

متن کامل

Swapping Variables for High-Dimensional Sparse Regression with Correlated Measurements

We consider the high-dimensional sparse linear regression problem of accurately estimating a sparse vector using a small number of linear measurements that are contaminated by noise. It is well known that the standard cadre of computationally tractable sparse regression algorithms—such as the Lasso, Orthogonal Matching Pursuit (OMP), and their extensions—perform poorly when the measurement matr...

متن کامل

High resolution sparse estimation of exponentially decaying N-dimensional signals

In this work, we consider the problem of high-resolution estimation of the parameters detailing an N-dimensional (N-D) signal consisting of an unknown number of exponentially decaying sinusoidal components. Since such signals are not sparse in an oversampled Fourier matrix, earlier approaches typically exploit large dictionary matrices that include not only a finely spaced frequency grid, but a...

متن کامل

High dimensional change point estimation via sparse projection

Changepoints are a very common feature of Big Data that arrive in the form of a data stream. In this paper, we study high-dimensional time series in which, at certain time points, the mean structure changes in a sparse subset of the coordinates. The challenge is to borrow strength across the coordinates in order to detect smaller changes than could be observed in any individual component series...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review applied

سال: 2022

ISSN: ['2331-7043', '2331-7019']

DOI: https://doi.org/10.1103/physrevapplied.18.064040